Euler integration over definable functions

We extend the theory of Euler integration from the class of constructible functions to that of "tame" real-valued functions (definable with respect to an o-minimal structure). The corresponding integral operator has some unusual defects (it is not a linear operator); however, it has a compelling Morse-theoretic interpretation. In addition, we show that it is an appropriate setting in which to do numerical analysis of Euler integrals, with applications to incomplete and uncertain data in sensor networks.Comment: 6 page

Morse theory on spaces of braids and Lagrangian dynamics

In the first half of the paper we construct a Morse-type theory on certain spaces of braid diagrams. We define a topological invariant of closed positive braids which is correlated with the existence of invariant sets of parabolic flows defined on discretized braid spaces. Parabolic flows, a type of one-dimensional lattice dynamics, evolve singular braid diagrams in such a way as to decrease their topological complexity; algebraic lengths decrease monotonically. This topological invariant is derived from a Morse-Conley homotopy index and provides a gloablization of `lap number' techniques used in scalar parabolic PDEs. In the second half of the paper we apply this technology to second order Lagrangians via a discrete formulation of the variational problem. This culminates in a very general forcing theorem for the existence of infinitely many braid classes of closed orbits.Comment: Revised version: numerous changes in exposition. Slight modification of two proofs and one definition; 55 pages, 20 figure

Solar Radiation Pressure Binning for the Geosynchronous Orbit

Orbital maintenance parameters for individual satellites or groups of satellites have traditionally been set by examining orbital parameters alone, such as through apogee and perigee height binning; this approach ignored the other factors that governed an individual satellite's susceptibility to non-conservative forces. In the atmospheric drag regime, this problem has been addressed by the introduction of the "energy dissipation rate," a quantity that represents the amount of energy being removed from the orbit; such an approach is able to consider both atmospheric density and satellite frontal area characteristics and thus serve as a mechanism for binning satellites of similar behavior. The geo-synchronous orbit (of broader definition than the geostationary orbit -- here taken to be from 1300 to 1800 minutes in orbital period) is not affected by drag; rather, its principal non-conservative force is that of solar radiation pressure -- the momentum imparted to the satellite by solar radiometric energy. While this perturbation is solved for as part of the orbit determination update, no binning or division scheme, analogous to the drag regime, has been developed for the geo-synchronous orbit. The present analysis has begun such an effort by examining the behavior of geosynchronous rocket bodies and non-stabilized payloads as a function of solar radiation pressure susceptibility. A preliminary examination of binning techniques used in the drag regime gives initial guidance regarding the criteria for useful bin divisions. Applying these criteria to the object type, solar radiation pressure, and resultant state vector accuracy for the analyzed dataset, a single division of "large" satellites into two bins for the purposes of setting related sensor tasking and orbit determination (OD) controls is suggested. When an accompanying analysis of high area-to-mass objects is complete, a full set of binning recommendations for the geosynchronous orbit will be available

Computing the kk-coverage of a wireless network

Coverage is one of the main quality of service of a wirelessnetwork. $k$-coverage, that is to be covered simultaneously by $k$network nodes, is synonym of reliability and numerous applicationssuch as multiple site MIMO features, or handovers. We introduce here anew algorithm for computing the $k$-coverage of a wirelessnetwork. Our method is based on the observation that $k$-coverage canbe interpreted as $k$ layers of $1$-coverage, or simply coverage. Weuse simplicial homology to compute the network's topology and areduction algorithm to indentify the layers of $1$-coverage. Weprovide figures and simulation results to illustrate our algorithm.Comment: Valuetools 2019, Mar 2019, Palma de Mallorca, Spain. 2019. arXiv admin note: text overlap with arXiv:1802.0844